Counting Strings with Given Elementary Symmetric Function Evaluations II: Circular Strings
نویسندگان
چکیده
منابع مشابه
Counting Strings with Given Elementary Symmetric Function Evaluations II: Circular Strings
Let α be a string over an alphabet that is a finite ring, R. The k-th elementary symmetric function evaluated at α is denoted Tk(α). In a companion paper we studied the properties of SR(n; τ1, τ2, . . . , τk), the set of of length n strings for which Ti(α) = τi. Here we consider the set, LR(n; τ1, τ2, . . . , τk), of equivalence classes under rotation of aperiodic strings in SR(n; τ1, τ2, . . ....
متن کاملCounting Strings over Z2 with Given Elementary Symmetric Function Evaluations
Let α be a string over Zq , where q = 2. The j-th elementary symmetric function evaluated at α is denoted ej(α). We study the cardinalities Sq(m; τ1, τ2, . . . , τt) of the set of length m strings for which ei(α) = τi. The profile k(α) = 〈k1, k2, . . . , kq−1〉 of a string α is the sequence of frequencies with which each letter occurs. The profile of α determines ej(α), and hence Sq . Let hn : Z...
متن کاملCounting Strings with Given Elementary Symmetric Function Evaluations I: Strings over Zp with p Prime
Let α be a string over Zp with p prime. The j-th elementary symmetric function evaluated at α is denoted Tj(α). We study the cardinalities Sp(n; τ1, τ2, . . . , τt) of the set of length n strings for which Ti(α) = τi. The profile 〈k0, k1, . . . , kp−1〉 of a string α is the sequence of frequencies with which each letter occurs. The profile of α determines Tj(α), and hence Sp. Let fn : Zp−1 pn 7→...
متن کاملCounting States of Black Strings with Traveling Waves II
We extend our recent analysis of the entropy of extremal black strings with traveling waves. We previously considered waves carrying linear momentum on black strings in six dimensions. Here we study waves carrying angular momentum on these strings, and also waves carrying linear momentum on black strings in five dimensions. In both cases, we show that the horizon remains homogeneous and compute...
متن کاملCounting Suffix Arrays and Strings
Suffix arrays are used in various application and research areas like data compression or computational biology. In this work, our goal is to characterize the combinatorial properties of suffix arrays and their enumeration. For fixed alphabet size and string length we count the number of strings sharing the same suffix array and the number of such suffix arrays. Our methods have applications to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2004
ISSN: 0895-4801,1095-7146
DOI: 10.1137/s0895480103428053